RIBRA-An Error-Tolerant Algorithm for the NMR Backbone Assignment Problem

نویسندگان

  • Kuen-Pin Wu
  • Jia-Ming Chang
  • Jun-Bo Chen
  • Chi-Fon Chang
  • Wen-Jin Wu
  • Tai-Huang Huang
  • Ting-Yi Sung
  • Wen-Lian Hsu
چکیده

We develop an iterative relaxation algorithm called RIBRA for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to solve the problem. To deal with noisy NMR spectral data, RIBRA is executed in an iterative fashion based on the quality of spectral peaks. We first produce spin system pairs using the spectral data without missing peaks, then the data group with one missing peak, and finally, the data group with two missing peaks. We test RIBRA on two real NMR datasets, hbSBD and hbLBD, and perfect BMRB data (with 902 proteins) and four synthetic BMRB data which simulate four kinds of errors. The accuracy of RIBRA on hbSBD and hbLBD are 91.4% and 83.6%, respectively. The average accuracy of RIBRA on perfect BMRB datasets is 98.28%, and 98.28%, 95.61%, 98.16%, and 96.28% on four kinds of synthetic datasets, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Automated Structure-Based NMR Resonance Assignment

We propose a general framework for solving the structurebased NMR backbone resonance assignment problem. The core is a novel 0-1 integer programming model that can start from a complete or partial assignment, generate multiple assignments, and model not only the assignment of spins to residues, but also pairwise dependencies consisting of pairs of spins to pairs of residues. It is still a chall...

متن کامل

Towards Fully Automated Structure-Based NMR Resonance Assignment of 15N-Labeled Proteins From Automatically Picked Peaks

In NMR resonance assignment, an indispensable step in NMR protein studies, manually processed peaks from both N-labeled and C-labeled spectra are typically used as inputs. However, the use of homologous structures can allow one to use only N-labeled NMR data and avoid the added expense of using C-labeled data. We propose a novel integer programming framework for structure-based backbone resonan...

متن کامل

IPASS: Error Tolerant NMR Backbone Resonance Assignment by Linear Programming

The automation of the entire NMR protein structure determination process requires a superior error tolerant backbone resonance assignment method. Although a variety of assignment approaches have been developed, none works well on noisy automatically picked peaks. IPASS is proposed as a novel integer linear programming (ILP) based assignment method. In order to reduce size of the problem, IPASS ...

متن کامل

Error Tolerant NMR Backbone Resonance Assignment for Automated Structure Generation

Error tolerant backbone resonance assignment is the cornerstone of the NMR structure determination process. Although a variety of assignment approaches have been developed, none works well on noisy automatically picked peaks. We have designed an integer linear programming (ILP) based assignment system (IPASS) for this purpose. In order to reduce size of the problem, IPASS employs probabilistic ...

متن کامل

Error Tolerant NMR Backbone Resonance Assignment and Automated Structure Generation

Error tolerant backbone resonance assignment is the cornerstone of the NMR structure determination process. Although a variety of assignment approaches have been developed, none works sufficiently well on noisy fully automatically picked peaks to enable the subsequent automatic structure determination steps. We have designed an integer linear programming (ILP) based assignment system (IPASS) th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of computational biology : a journal of computational molecular cell biology

دوره 13 2  شماره 

صفحات  -

تاریخ انتشار 2005